Partial Stable Models for Logic Programs with Aggregates
نویسندگان
چکیده
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We also give a specific instance of the semantics and show that it has several attractive features.
منابع مشابه
Semantics of Logic Programs withAggregatesDavid
We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbols and negation. In particular we address the meaning of programs with recursion through aggregation. We extend the two most successful semantic approaches to the problem of recursion through negation, well founded models and stable models, to programs with aggregates. We examine previously deene...
متن کاملStrong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
A formalism called partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. In PEL one defines a class of minimal models, called partial equilibrium models, in a non-classical logic, HT . On logic programs partial equilibrium models coincide with Przymusinski’s partial stable (p-stable) models, so that PEL can be ...
متن کاملGenerated Models and Extensions of Nonmonotonic Systems
Stable generated models provide a general semantics for logic programming. Although equal for normal programs, they diier from the answer set semantics on disjunctive programs. We show that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded. This leads us to a new v...
متن کاملSemantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can be derived from it. No such systematic operator-based approach to semantics of disjunctive logic programs has been developed so far. This paper is the first step in this direction. We formalize the concept of one-step-...
متن کاملRelating weight constraint and aggregate programs: Semantics and representation
Weight constraint and aggregate programs are among the most widely used logic programs with constraints. In this paper, we relate the semantics of these two classes of programs, namely the stable model semantics for weight constraint programs and the answer set semantics based on conditional satisfaction for aggregate programs. Both classes of programs are instances of logic programs with const...
متن کامل